Risk management for cyber-infrastructure protection: A bi-objective integer programming approach
نویسندگان
چکیده
Information and communication technology supply chains present risks that are complex difficult for organizations to manage. The cost benefit of proposed security controls must be assessed best match an organizational risk tolerance direct the use resources. In this paper, we integer stochastic optimization models selecting a portfolio within budget. We consider two objectives: maximize reduction across all potential attacks number whose levels lower than threshold after applied. Deterministic bi-objective budgeted difficulty-threshold control selection problems formulated mitigating reflect organization’s preference. problem, uncertainty as whether selected can reduce associated with attacks. demonstrate through computational study trade-off between objectives is important certain preferences budgets. value model when relatively high desired secured past show deterministic solution provides near optimal solutions otherwise. provide analysis solutions.
منابع مشابه
A two-stage approach for bi-objective integer linear programming
We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...
متن کاملA parallel approach to bi-objective integer programming
To obtain a better understanding of the trade-offs between various objectives, Bi-Objective Integer Programming (BOIP) algorithms calculate the set of all non-dominated vectors and present these as the solution to a BOIP problem. Historically, these algorithms have been compared in terms of the number of single-objective IPs solved and total CPU time taken to produce the solution to a problem. ...
متن کاملBranch-and-bound for bi-objective integer programming
In Pareto bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions, and cutting plane generation taking advantage of integer objective values. The developed algorithm is applied to the bi-objective team ori...
متن کاملDynamic programming algorithms for the bi-objective integer knapsack problem
This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multiobjective integer knapsack problem is identified. The first algorithm is developed by directly using the property. The second algorithm is a hybrid DP approach using the concept of the boun...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Reliability Engineering & System Safety
سال: 2021
ISSN: ['1879-0836', '0951-8320']
DOI: https://doi.org/10.1016/j.ress.2020.107093